Networks based on collisions among mobile agents
نویسندگان
چکیده
منابع مشابه
Networks based on collisions among mobile agents
We investigate in detail a recent model of colliding mobile agents [Phys. Rev. Lett. 96, 088702], used as an alternative approach to construct evolving networks of interactions formed by the collisions governed by suitable dynamical rules. The system of mobile agents evolves towards a quasi-stationary state which is, apart small fluctuations, well characterized by the density of the system and ...
متن کاملAntNet: Routing Algorithm for Data Networks based on Mobile Agents
AntNet is an innovative algorithm for packet routing in communication networks, originally proposed by M. Dorigo and G. Di Caro, in 1997. In AntNet, a group of mobile agents (or artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging obtained information to update the routing tables. This work analyzes AntNet and proposes improvements that were impl...
متن کاملMobile agents based routing protocol for mobile ad hoc networks
A novel routing scheme for mobile ad hoc networks (MANETs), which combines the on-demand routing capability of Ad Hoc On-Demand Distance Vector (AODV) routing protocol with a distributed topology discovery mechanism using ant-like mobile agents is proposed in this paper. The proposed hybrid protocol reduces route discovery latency and the end-to-end delay by providing high connectivity without ...
متن کاملTransportation dynamics on networks of mobile agents
Most existing works on transportation dynamics focus on networks of a fixed structure, but networks whose nodes are mobile have become widespread, such as cell-phone networks. We introduce a model to explore the basic physics of transportation on mobile networks. Of particular interest is the dependence of the throughput on the speed of agent movement and the communication range. Our computatio...
متن کاملGreedy routing on networks of mobile agents
In this paper, we design a greedy routing on networks of mobile agents. In the greedy routing algorithm, every time step a packet in agent i is delivered to the agent j whose distance from the destination is shortest among searched neighbors of agent i. Based on the greedy routing, we study the traffic dynamics and traffic-driven epidemic spreading on networks of mobile agents. We find that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2006
ISSN: 0167-2789
DOI: 10.1016/j.physd.2006.09.025